A Minimal Rk-degree
نویسندگان
چکیده
We construct a minimal rK-degree, continuum many, in fact. We also show that every minimal sequence, that is, a sequence with minimal rK-degree, must have very low descriptional complexity, that every minimal sequence is rK-reducible to a random sequence, and that there is a random sequence with no minimal sequence rK-reducible to it.
منابع مشابه
TR 31 / 0 5 A Minimal rK - degree
Foreword This technical report contains a research paper, development or tutorial article, which has been submitted for publication in a journal or for consideration by the commissioning organization. The report represents the ideas of its author, and should not be taken as the official views of the School or the University. Any discussion of the content of the report should be sent to the auth...
متن کاملPutting topologies on dp-minimal fields
4. If b ∈ acl(aS), then dp-rk(b/S) ≤ dp-rk(a/S). 5. dp-rk(ab/S) ≤ dp-rk(a/bS) + dp-rk(b/S). We work in a monster model C of a dp-minimal field (i.e., a field of dp-rank 1). “Models” will refer to small elementary substructures M C. We’ll write concatenation multiplicatively and multiplication using ·. We will assume that C is not strongly minimal. One already knows what strongly minimal fields ...
متن کاملOn the Structure of the Set of Bifurcation Points of Periodic Solutions for Multiparameter Hamiltonian Systems
This paper deals with periodic solutions of the Hamilton equation ẋ(t) = J∇xH(x(t), λ), where H ∈ C2,0(R2n × Rk,R) and λ ∈ Rk is a parameter. Theorems on global bifurcation of solutions with periods 2π j , j ∈ N, from a stationary point (x0, λ0) ∈ R2n × Rk are proved. ∇xH(x0, λ0) can be singular. However, it is assumed that the local topological degree of ∇xH(·, λ0) at x0 is nonzero. For system...
متن کاملOn The Fractional Minimal Cost Flow Problem of a Belief Degree Based Uncertain Network
A fractional minimal cost flow problem under linear type belief degree based uncertainty is studied for the first time. This type of uncertainty is useful when no historical information of an uncertain event is available. The problem is crisped using an uncertain chance-constrained programming approach and its non-linear objective function is linearized by a variable changing approach. An illus...
متن کاملPolynomial Structures for Nilpotent Groups
If a polycyclic-by-finite rank-K group Γ admits a faithful affine representation making it acting on RK properly discontinuously and with compact quotient, we say that Γ admits an affine structure. In 1977, John Milnor questioned the existence of affine structures for such groups Γ. Very recently examples have been obtained showing that, even for torsion-free, finitely generated nilpotent group...
متن کامل